Image Compression versus Matching Accuracy

نویسندگان

  • Michael Kiefner
  • Michael Hahn
چکیده

The improvements of aerial image scanners regarding the scan resolution and in particular the development of new digital cameras (e.g. the DMC of Z/I Imaging) comes along with the production of Gigabytes of image data. To handle these big data sets image compression algorithms are applied. The number of developed image compression procedures is growing and investigations of the consequences for photogrammetric image processing are becoming very important for users of compressed image data. This paper investigates theoretically and experimentally the impact of different compression algorithms on image matching quality. The focus is laid on automated point transfer using the area based least squares matching principle. Other automated processes like aerial triangulation, DTM acquisition and relative orientation often directly rely on the results of the employed point transfer process thus consequences on these processes are inferable. In the experimental investigations simulated stereo imagery and real stereo image pairs are taken into account. Representative algorithms of three different compression methods, the JPEG, Wavelet and Fractal compression, are used to verify and quantify the theoretically found relation between matching accuracy and compression ratio. Regarding the peak-signal-to-noise-ratio (PSNR) of the images induced by compression, Wavelet compression proves to be superior to JPEG and Fractal compression. With respect to the success rate and matching accuracy of point transfer a continuous decrease is to be expected with increasing compression rate. But unlike the PSNR results a changed ranking of the compression methods has to be observed. The highest matching success quotas combined with the most precise point transfer were achieved with the JPEG algorithm. Wavelet compression followed quite closely but Fractal compression dropped down significantly, therefore is not recommended for photogrammetric applications. For high precision point transfer, which is required in most photogrammetric applications, the investigations show that compression ratios not lower than 1:5 can be tolerated. Using images with lower compression ratios will produce point transfer errors above 0.1 to 0.2 pixels.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Effects of Image Compression on Automated DTM Generation

The effects of JPEG compression on automated DTM extraction via the approach of feature-based matching are investigated. JPEG lossy compression involves a truncation of higher spatial frequency data, a process which influences the accuracy of computation of grey-value gradients in the feature determination phases of image matching. Resulting accuracy effects on DTM heights obtained via the MATC...

متن کامل

A New RSTB Invariant Image Template Matching Based on Log-Spectrum and Modified ICA

Template matching is a widely used technique in many of image processing and machine vision applications. In this paper we propose a new as well as a fast and reliable template matching algorithm which is invariant to Rotation, Scale, Translation and Brightness (RSTB) changes. For this purpose, we adopt the idea of ring projection transform (RPT) of image. In the proposed algorithm, two novel s...

متن کامل

Contourlet-Based Edge Extraction for Image Registration

Image registration is a crucial step in most image processing tasks for which the final result is achieved from a combination of various resources. In general, the majority of registration methods consist of the following four steps: feature extraction, feature matching, transform modeling, and finally image resampling. As the accuracy of a registration process is highly dependent to the fe...

متن کامل

Fast and memory efficient text image compression with JBIG2

In this paper, we investigate ways to reduce encoding time, memory consumption and substitution errors for text image compression with JBIG2. We first look at page striping where the encoder splits the input image into horizontal stripes and processes one stripe at a time. We propose dynamic dictionary updating procedures for page striping to reduce the bit rate penalty it incurs. Experiments s...

متن کامل

Compressed Pattern Matching for Text

The amount of information that we are dealing with today is being generated at an everincreasing rate. On one hand, data compression is needed to efficiently store, organize the data and transport the data over the limited-bandwidth network. On the other hand, efficient information retrieval is needed to speedily find the relevant information from this huge mass of data using available resource...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010